Even poset and a parity result for binary linear code
نویسنده
چکیده
Let C be a linear binary code, namely a subspace of the space consisting of all binary vectors of a fixed length. A vector in C is maximal provided it has a maximal support among C; a nonzero vector in C is minimal provided it has a minimal support among C \ {0}. We prove that the sum of all maximal vectors of C equals the sum of all minimal vectors of C. In course of this research, we introduce the concept of even poset and establish a duality result for it. © 2006 Elsevier Inc. All rights reserved. AMS classification: 05C45; 06A06; 15A03
منابع مشابه
On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure
Ahn et al. [Discrete Math. 268 (2003) 21–30] characterized completely the parameters of singleand error-correcting perfect linear codes with a crown poset structure by solving Ramanujan–Nagelltype Diophantine equation. In this paper, we give a shorter proof for the same result by analyzing a generator matrix of a perfect linear code. Furthermore, we combine our method with the Johnson bound in ...
متن کامل1 Binary Greedy Codes
In this paper, we provide a simpler proof of a previously known result about greedily generated binary codes. We consider the mapping g: Vn ⇒ Vm, which sends binary vectors to their gvalues obtained from a B-ordering. We show that g is a homomorphism via a proof by induction on gvalues. The proof depends on a previous result that the set of vectors having g-value 0 is a linear code. We also dis...
متن کاملA new asymptotically optimal code for the positive integers
A method of constructing binary linear codes is presentedthat have a minimum Hamming distance of five. Some efficient newcodes are obtained. In particular, a (47,36,5) code is obtained that hassix more information bits than the best previously known code with 11check bits.In Section II, we propose a general formulation of paritycheck matrix for the desired code. We then ...
متن کاملThe poset structures admitting the extended binary Golay code to be a perfect code
Brualdi et al. [Codes with a poset metric, Discrete Math. 147 (1995) 57–72] introduced the concept of poset codes, and gave an example of poset structure which admits the extended binary Golay code to be a 4-error-correcting perfect P-code. In this paper we classify all of the poset structures which admit the extended binary Golay code to be a 4-error-correcting perfect P-code, and show that th...
متن کاملBinary set functions and parity check matrices
We consider the possibility of extending to a family of sets a binary set function defined on a subfamily so that the extension is, in fact, uniquely determined. We place in this context the problem of finding the least integer n(r) such that every linear code of length n with n B n(r), dimension n r and minimum Hamming distance at least 4 has a parity check matrix composed entirely of odd weig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006